Energy Efficient Execution of POMDP Policies

Prioritized Execution of Privacy Policies

This paper addresses the issue of solving conflicts occurring in the authorization decision process among policies applicable to an access request. We propose a strategy for conflict resolution based on the evaluation of the specificity level of the elements constituting the policies. Operatively, the strategy is implemented by exploiting a well known decision making technique. Two practical ex...

POMDP planning and execution in an augmented space

In planning with partially observable Markov decision processes, pre-compiled policies are often represented as finite state controllers or sets of alpha-vectors, which provide a lower bound on the value of the optimal policy. Some algorithms (e.g., HSVI2, SARSOP, GapMin) also compute an upper bound to guide the search and to offer performance guarantees, but they do not derive a policy from th...

Run-Time Improvement of Point-Based POMDP Policies

The most successful recent approaches to partially observable Markov decision problem (POMDP) solving have largely been point-based approximation algorithms. These work by selecting a finite number of belief points, computing alpha-vectors for those points, and using the resulting policy everywhere. However, if during execution the belief state is far from the points, there is no guarantee that...

A Hierarchical Approach to POMDP Planning and Execution

Scalable and Energy Efficient Execution Methods for Multicore Systems

Multicore architectures impose great pressure on resource management. The exploration spaces available for resource management increase explosively, especially for large-scale highend computing systems. The availability of abundant parallelism causes scalability concerns at all levels. Multicore architectures also impose pressure on power management. Growth in the number of cores causes continu...